The linear ordering problem: an algorithm for the optimal solution
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Multi-parent Memetic Algorithm for the Linear Ordering Problem
In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a multi-parent recombination operator for generating offspring solutions and a distance-and-quality based criterion for pool updating. Our MPM algorithm is assessed on 8 sets of 484 widely used LOP instances and compared wi...
متن کاملDesigning A Hybrid Genetic Algorithm for the Linear Ordering Problem
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general procedure of designing a hybrid genetic algorithm, which includes the selection of crossover/mutation operators, accelerating the local search module and tuning the parameters. Experimental results show that our hybrid ge...
متن کاملSolution of the Linear Ordering Problem (NP=P)
j=1 cijxij s. t. 0 6 xij 6 1, xij + xji = 1, 0 6 xij + xjk − xik 6 1, i 6= j, i 6= k, j 6= k, i, j, k = 1, ..., n. We denote the corresponding polytope by Bn. The polytope Bn has integer vertices corresponding to feasible solutions of the linear ordering problem as well as non-integer vertices. We denote the polytope of integer vertices as Pn. Let us give an example of non-integer vertex in Bn ...
متن کاملAn Algorithm for Obtaining Optimal Compromise Solution of a Multi Objective Fuzzy Linear Programming Problem
This paper proposes the method to the solution of multi objective linear programming problems in fuzzy environment. Here attention has been paid to the study of optimal compromise solution for multi objective fuzzy linear programming problems. Two algorithms have been presented to gives efficient solutions as well as an optimal compromise solution. An illustrative example is given to describe o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: African Journal of Science and Technology
سال: 2010
ISSN: 1607-9949
DOI: 10.4314/ajst.v6i1.55167